Evaluation of a Semi-Automated Theorem Prover (Part II)
نویسنده
چکیده
This report describes a pilot study of the Barnacle interface to the Clam automated theorem prover. The intent is to gather information about the usability of Barnacle for inductive theorem proving. This information is intended to guide further development of the Barnacle interface to Clam. The focus is on the utility of Barnacle in allowing users to spot toiling proofs and to intervene to rectify such proofs, usually by overriding Clam’s choice of induction schema. The results tentatively indicate that Barnacle does facilitate user interaction with Clam to avoid unproductive proof steps. Opinions gathered from the subjects show a favourable reaction to the Barnacle interface and provide some pointers to future work on the interface. The results also show the potential benefits of providing interactivity to fully-automated theorem provers via an effective interface.
منابع مشابه
Evaluation of a Semi-Automated Theorem Prover (Part I)
So little evaluation has been carried out on user interfaces to theorem provers that even the question of what should be evaluated appears open. We took a user/task related approach, where subjects in a pilot study were given three theorems to prove, which might or might not require intervention by the user, and logged some of their interactions. In this paper, we describe the facets of semi-au...
متن کاملXBarnacle: Making Theorem Provers More Accessible
XBarnacle was built to meet the challenge of incorporating interactive features in the automated theorem prover CLAM whilst preserving the advantages of automation. Many people are not able to use theorem provers to their full strength. The aim of our research is to make semi-automated theorem proving a real possibility for a wide range of people – from those primarily interested in formal spec...
متن کاملAgda as a platform for the development of verified railway interlocking systems
This thesis identifies a technological framework that aids the development of verified railway interlocking systems in the Agda theorem prover. The thesis is in two parts, Part I deals with integrating interactive and automated theorem proving in type theory, and Part II addresses verification in the
متن کاملA single axiom for semi-Boolean SQS-skeins
In this note, we show that the variety of semi-Boolean SQS-skeins can be defined by a single axiom and exhibit a single axiom for said variety that was found with the aid of the automated theorem-prover Prover9.
متن کاملDually quasi-De Morgan Stone semi-Heyting algebras II. Regularity
This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...
متن کامل